Combinatorics of certain abelian Lie group arrangements and chromatic quasi-polynomials

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs

In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...

متن کامل

Chromatic polynomials of some nanostars

Let G be a simple graph and (G,) denotes the number of proper vertex colourings of G with at most  colours, which is for a fixed graph G , a polynomial in  , which is called the chromatic polynomial of G . Using the chromatic polynomial of some specific graphs, we obtain the chromatic polynomials of some nanostars.

متن کامل

Divisibility of certain coefficients of the chromatic polynomials

This note presents some results on the divisibility of certain coe"cients of the chromatic polynomials. c © 2003 Elsevier B.V. All rights reserved.

متن کامل

Lie Algebras and Combinatorics

where q is an indeterminate. See [1] for the history, proof,combinatorial interpretation and generalization of (1) and its companion identity. I shall describe the evolution of a program, just completed, for understanding such identities as (1) in terms of Kac-Moody Lie algebras. This program is related to topology, and probably physics, as well as combinatorics. A Kac-Moody Lie algebra ([9], [...

متن کامل

Chromatic Polynomials and Representations of the Symmetric Group

The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a graph G when k colours are available. The fact that it is a polynomial function of k is essentially a consequence of the fact that, when k exceeds the number of vertices of G, not all the colours can be used. Another quite trivial property of the construction is that the names of the k colours are im...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 2019

ISSN: 0097-3165

DOI: 10.1016/j.jcta.2019.02.003